Hardware Based Parallel Phrase Matching Engine in Dictionary Compressor
نویسندگان
چکیده
منابع مشابه
A Simple Parallel Dictionary Matching Algorithm
In the Parallel Dictionary Matching problem a set of patterns D is xed at the beginning, and the following Query(T) operation has to be quickly supported: given an arbitrary text T 1; t], for each text position i retrieve the longest pattern in D that is a preex of T i; t]. In this paper, we present a simple and space-eecient CRCW PRAM algorithm which takes optimal work to answer Query(T) in th...
متن کاملHardware Based Binary Arithmetic Engine
Context Based Binary Arithmetic Coding (CBAC) is a part of JZ profile of Audio Video Coding Standard (AVS).The goal of this paper is to present the efficient hardware based binary arithmetic coder which is the main part of binarisation involved in CBAC of AVS. This paper explains about the efficient arithmetic coding involved in the video transcoding. The major concerns of using JZ profile of A...
متن کاملPhrase-Based Pattern Matching in Compressed Text
Byte codes are a practical alternative to the traditional bit-oriented compression approaches when large alphabets are being used, and trade away a small amount of compression effectiveness for a relatively large gain in decoding efficiency. Byte codes also have the advantage of being searchable using standard string matching techniques. Here we describe methods for searching in byte-coded comp...
متن کاملXML-based Phrase Alignment in Parallel Treebanks
This paper describes the usage of XML for representing cross-language phrase alignments in parallel treebanks. We have developed a TreeAligner as a tool for interactively inserting and correcting such alignments as an independent level of treebank annotation.
متن کامل5.2 Dynamic Matching 5.1 Parallel Static Dictionary Matching 3.2 Compressed Tries 4 Trie Based Dictionary Matching Algorithm 4.1 a Separator Decomposition Tree 3.1 Denition and Construction
The standard string matching problem involves nding all occurrences of a single pattern in a single text. While this approach works well in many application areas, there are some domains in which it is more appropriate to deal with dictionaries of patterns. A dictionary is a set of patterns; the goal of dictionary matching is to nd all dictionary patterns in a given text, simultaneously. In str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2018
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2018pal0001